Spanning trees in complete uniform hypergraphs and a connection to extended Shi hyperplane arrangements
نویسنده
چکیده
We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r ≥ 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from spanning trees of the complete (r + 1)-uniform hypergraph which arise from a fixed r-perfect matching (see Section 2) and r-Parking functions. We observe a simple consequence of this bijection in terms of the number of regions of the extended Shi arrangement S n.
منابع مشابه
Spanning trees in complete uniform hypergraphs and a connection to r-extended Shi hyperplane arrangements
We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r ≥ 3. Similar to the bijection between spanning trees of the complete graph on (n + 1) vertices and Parking functions of length n, we derive a bijection from spanning trees of the complete (r + 1)-uniform hypergraph which arise from a fixed r-perfect matching (see Section 2) and r-P...
متن کاملInterpreting the two variable Distance enumerator of the Shi hyperplane arrangement
We give an interpretation of the coefficients of the two variable refinement DSn(q, t) of the distance enumerator of the Shi hyperplane arrangement Sn in n dimensions. This two variable refinement was defined by Stanley [St-98] for the general r-extended Shi hyperplane arrangements. We give an interpretation when r = 1. We define three natural three-dimensional partitions of the number (n+1)n−1...
متن کاملThe active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region
The present paper is the first in a series of four dealing with a mapping, introduced by the present authors, from orientations to spanning trees, from regions to simplices in real hyperplane arrangements, from reorientations to bases in oriented matroids (in order of increasing generality). This mapping is actually defined for oriented matroids on a linearly ordered ground set. We call it the ...
متن کاملDeformations of the Braid Arrangement and Trees Dedicated to Ira Gessel for His Retirement
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form xi − xj = s for some integer s. Classical examples include the braid, Catalan, Shi, semiorder and Linial arrangements, as well as graphical arrangements. We express the number of regions of any such arrangement...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کامل